全文获取类型
收费全文 | 319篇 |
免费 | 88篇 |
国内免费 | 17篇 |
出版年
2023年 | 2篇 |
2022年 | 5篇 |
2021年 | 7篇 |
2020年 | 4篇 |
2019年 | 8篇 |
2018年 | 5篇 |
2017年 | 17篇 |
2016年 | 22篇 |
2015年 | 9篇 |
2014年 | 27篇 |
2013年 | 18篇 |
2012年 | 9篇 |
2011年 | 21篇 |
2010年 | 14篇 |
2009年 | 26篇 |
2008年 | 25篇 |
2007年 | 24篇 |
2006年 | 23篇 |
2005年 | 21篇 |
2004年 | 17篇 |
2003年 | 11篇 |
2002年 | 18篇 |
2001年 | 23篇 |
2000年 | 15篇 |
1999年 | 11篇 |
1998年 | 7篇 |
1997年 | 8篇 |
1996年 | 7篇 |
1995年 | 3篇 |
1993年 | 2篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1987年 | 1篇 |
排序方式: 共有424条查询结果,搜索用时 15 毫秒
31.
Adam D.M. Svendsen 《Defense & Security Analysis》2015,31(1):58-73
This article aims to encourage the fostering of more systems thinking, and its greater exploitation, within the domain of contemporary intelligence. With particular focus on “micro systems thinking” and with reference to key intelligence processes, such as intelligence analysis, the utility of many systems dynamics within the intelligence context seeks to be further revealed. Through their greater collective harnessing, including up to “System of Systems” (“SoS”) dynamics, and promoting all that they can offer, more sophisticated overarching operational-to-strategic/policy “ends,” notably that of “defence-in-depth,” can be viably further advanced in a sustainable manner into the future. Arguably, a much-needed transformative impact on contemporary intelligence can also be increasingly realised through comprehensively engaging in and with more systems and SoS thinking. Aiding civil protection tasks, crisis management, emergency planners, and civil contingency practitioners likewise gain. 相似文献
32.
33.
针对OFDM系统中的信道估计问题,提出了一种基于扩展H∞滤波的OFDM自适应盲信道估计方法。该方法通过对常规H∞算法进行改进,实现了在OFDM系统中能自适应跟踪信道的变化特征,从而使均方误差的性能随着输入信噪比的增加得到很大的提高。仿真结果也验证了该算法优于卡尔曼和H∞估计算法,具有计算复杂度低,运算量小、收敛速度快、算法灵活等特性。 相似文献
34.
针对现有星载AIS检测概率低的问题,对星载AIS接收信号冲突和检测概率进行了研究和论证,并对影响检测概率的诸多因素进行了分析。分析了星载AIS与地面AIS的差异性,指出了星载AIS面临的新挑战。重点对星载AIS信号多网冲突问题进行了研究,建立了一种基于船舶分布密度函数的星载AIS检测概率模型。通过分析时隙冲突、船舶动态、轨道高度、天线类型和B类AIS船舶等因素对系统检测概率的影响,为工程设计和性能评估提供了一定参考依据。 相似文献
35.
Choosing arrival process models for service systems: Tests of a nonhomogeneous Poisson process 下载免费PDF全文
Service systems such as call centers and hospital emergency rooms typically have strongly time‐varying arrival rates. Thus, a nonhomogeneous Poisson process (NHPP) is a natural model for the arrival process in a queueing model for performance analysis. Nevertheless, it is important to perform statistical tests with service system data to confirm that an NHPP is actually appropriate, as emphasized by Brown et al. [8]. They suggested a specific statistical test based on the Kolmogorov–Smirnov (KS) statistic after exploiting the conditional‐uniform (CU) property to transform the NHPP into a sequence of i.i.d. random variables uniformly distributed on [0,1] and then performing a logarithmic transformation of the data. We investigate why it is important to perform the final data transformation and consider what form it should take. We conduct extensive simulation experiments to study the power of these alternative statistical tests. We conclude that the general approach of Brown et al. [8] is excellent, but that an alternative data transformation proposed by Lewis [22], drawing upon Durbin [10], produces a test of an NHPP test with consistently greater power. We also conclude that the KS test after the CU transformation, without any additional data transformation, tends to be best to test against alternative hypotheses that primarily differ from an NHPP only through stochastic and time dependence. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 66–90, 2014 相似文献
36.
When facing high levels of overstock inventories, firms often push their salesforce to work harder than usual to attract more demand, and one way to achieve that is to offer attractive incentives. However, most research on the optimal design of salesforce incentives ignores this dependency and assumes that operational decisions of production/inventory management are separable from design of salesforce incentives. We investigate this dependency in the problem of joint salesforce incentive design and inventory/production control. We develop a dynamic Principal‐Agent model with both Moral Hazard and Adverse Selection in which the principal is strategic and risk‐neutral but the agent is myopic and risk‐averse. We find the optimal joint incentive design and inventory control strategy, and demonstrate the impact of operational decisions on the design of a compensation package. The optimal strategy is characterized by a menu of inventory‐dependent salesforce compensation contracts. We show that the optimal compensation package depends highly on the operational decisions; when inventory levels are high, (a) the firm offers a more attractive contract and (b) the contract is effective in inducing the salesforce to work harder than usual. In contrast, when inventory levels are low, the firm can offer a less attractive compensation package, but still expect the salesforce to work hard enough. In addition, we show that although the inventory/production management and the design of salesforce compensation package are highly correlated, information acquisition through contract design allows the firm to implement traditional inventory control policies: a market‐based state‐dependent policy (with a constant base‐stock level when the inventory is low) that makes use of the extracted market condition from the agent is optimal. This work appears to be the first article on operations that addresses the important interplay between inventory/production control and salesforce compensation decisions in a dynamic setting. Our findings shed light on the effective integration of these two significant aspects for the successful operation of a firm. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 320–340, 2014 相似文献
37.
38.
为了应对卫星导航系统内部复杂关系等体系特征为其安全分析带来的挑战、全面识别和分析卫星导航系统面临的体系安全威胁、提高系统的安全性和服务能力,基于功能依赖网络分析理论提出了从体系角度研究卫星导航系统安全性的建模方法,重点对导航系统内组件系统之间交互关系导致的危险传播、任意失效组合进行了后果分析和原因调查。仿真结果表明该方法能清晰地描述危险传播和失效组合的过程以及进行正逆向的推理分析,也证明了该方法在卫星导航系统安全分析问题上的潜力和适用性。 相似文献
39.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
40.